package com.gwcloud.leetcode.hot100;

/** 
* @ClassName   : Leetcode0062 
* @author      : ganwei 
* @date        : 2020年5月18日 
* @Description : 62 不同路径 
*/
public class Leetcode0062 {
    public int uniquePaths(int m, int n) {
    	int[][] dp = new int[m][n];
    	//base case
    	for(int i = 0; i < m; i++) {
    		dp[i][0] = 1;
    	}
    	for(int i = 0; i < n; i++) {
    		dp[0][i] = 1;
    	}
    	
    	for(int i = 1; i < m; i++) {
    		for(int j = 1; j < n; j++) {
    			dp[i][j] = dp[i][j-1] + dp[i-1][j];
    		}
    	}
    	
    	return dp[m-1][n-1];
    }
    
    public static void main(String[] args) {
    	Leetcode0062 l0062 = new Leetcode0062();
    	System.out.println(l0062.uniquePaths(7, 3));
    }
}
